To Increase the Bound of Vertex in Overlay Relay Routing Nodes using Dynamic Threshold Function

The Overlay routing has been anticipated in recent years as a successful way to accomplish convinced routing properties, exclusive of going into the elongated and monotonous process of regularity and global deployment of a routing protocol. This gives ascend to the optimization, reliability, fault tolerant and high distributed problem which we overcome in this work we are using distributed and non-trival approximation algorithm. In order to arrange the physical infrastructure by an overlay routing, it will have the new superfluous functionality that needs to organize and deal with overlay nodes. In terms of capital and operating costs both can comes with a non-negligible cost. In the Internet BGP-based routing over the shortest-path routing example, the question can mapped to: Which is the least number of relay nodes that are essential in order to arrange the routing among a group of autonomous systems (ASs) utilize the underlying shortest path between them. In the TCP performance illustration, this may transform to: Which is the minimal number of relay nodes required in order to build an each TCP connection. Regardless of the specific suggestion in mind, To study the complication of common optimization problem called Overlay Routing Resource Allocation (ORRA) and complexity .but, we believe one-to-many or many-to-many scenarios, then the only overlay node may engross the path property of various paths, and thus choose the finest locations becomes a large amount of less